function [c,efficiency]=graphMeasure(conMatrix)

c = clustering_coef_wu(conMatrix); %average cluster coefficient for entire net   
c=nanmean(c);
conMatrix2d=1./conMatrix;             %from correlation values to lengths
D=distance_wei(conMatrix2d);       %distance matrix of min length path
[lambda,efficiency] = charpath(D);
%[lambda,efficiency]=Mycharpath(D); %charateristic path (lambda) e efficiency